Optimal Cutting Planes from the Group Relaxations

Quadratic Knapsack Relaxations Using Cutting Planes and Semidefinite Programming

Quadratic Knapsack Relaxations Using Cutting Planes andSemide nite

We investigate dominance relations between basic semideenite relaxations and classes of cuts. We show that simple semideenite relaxations are tighter than corresponding linear relaxations even in case of linear cost functions. Numerical results are presented illustrating the quality of these relaxations.

Cutting Planes from Wide Split Disjunctions

In this paper, we discuss an extension of split cuts that is based on widening the underlying disjunctions. That the formula for deriving intersection cuts based on splits can be adapted to this case has been known for a decade now. For the first time though, we present applications and computational results. We further discuss extensions of the existing theory with respect to cut strengthening...

Cutting planes from extended LP formulations

Given a mixed-integer set defined by linear inequalities and integrality requirements on some of the variables, we consider extended formulations of its continuous (LP) relaxation and study the effect of adding cutting planes in the extended space. In terms of optimization, extended LP formulations do not lead to better bounds as their projection onto the original space is precisely the origina...

On Optimal Sensor Placement with Hypercube Cutting Planes

We study the problem of locating sensors to detect the failure of any set of radiation sources in a system. For computing illumination data, we suggest the use of radiosity methods. We then consider the problem of optimising sensor placement to unambiguously identify any inactive sources. We show that the problem can be transformed from a numerical to a geometrical domain, relate it to set cove...